Bandwidth-constrained Clustering in Ad Hoc Networks

We present a survey of the basic mechanisms and properties of existing clustering algorithms for wireless ad hoc networks. Based on this evaluation, we then propose a new algorithm with improved stability and a lower communication overhead. This is partly achieved by using a maintenance function that modifies the existing clustering structure rather than building a new one from scratch. Preliminary simulations seem to indicate that the algorithm produces clusters of about the same size and stability as a comparable existing algorithm, while sending significantly fewer messages.